Extremal Theta-free planar graphs
نویسندگان
چکیده
منابع مشابه
Wheel-free planar graphs
A wheel is a graph formed by a chordless cycle C and a vertex u not in C that has at least three neighbors in C. We prove that every 3-connected planar graph that does not contain a wheel as an induced subgraph is either a line graph or has a clique cutset. We prove that every planar graph that does not contain a wheel as an induced subgraph is 3-colorable. AMS classification: 05C75 ∗Partially ...
متن کاملExtremal K(s, t)-free bipartite graphs
Throughout this paper only undirected simple graphs (without loops or multiple edges) are considered. Unless stated otherwise, we follow the book by Bollobás [2] for undefined terminology and definitions. LetG = G(m,n) = G(X,Y ) denote a bipartite graph with vertex classesX and Y such that |X| = m and |Y | = n. A complete bipartite subgraph with s vertices in the class X and t vertices in the c...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملDecompositions of quadrangle-free planar graphs
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and a graph with maximum degree at most 7. This degree restriction was improved to 6 by Borodin et al. We further lower this bound to 5 and show that it cannot be improved to 3.
متن کاملIntersection-Free Morphing of Planar Graphs
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morphing of planar graphs. Our algorithm uses a combination of different techniques to achieve smooth transformations: rigid morphing, compatible triangulations, as well as morphing based on interpolation of the convex repr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2019
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.111610